5 Two basic models of distributed computation

نویسنده

  • Aaron Sterling
چکیده

Distributed computing and parallel computing study different kinds of systems, but they both study concurrent algorithms that run on collections of processors. In parallel computing, processors are tightly coupled, which usually means they move in lockstep, communication between processors is fast, and neither processors nor communication channels suffer from errors. By contrast, in a distributed system, processors are loosely coupled, which often means that different processors take steps at different times, messages placed in communication channels may take a while to reach their destinations, and processors and message channels may fail completely.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

{66 () Composable Semantic Models for Actor Theories

We are interested in developing a semantic foundation that supports specifying, composing, and reasoning about components of open distributed systems. The actor model provides the basic elements for open distributed computation: encapsulation of state; independent concurrent units of computation; interaction; and dynamic creation and interconnection. In order to provide for composability, and f...

متن کامل

Assessment of Turbulent Models in Computation of Strongly Curved Open Channel Flows

Several rigorous turbulent models have been developed in the past years and it can be seen that more research is needed to reach a better understanding of their generality and precision by verifying their applications for distinct hydraulic phenomena; under certain assumptions. This survey evaluates the performance of Standard k-ε, Realizable k-ε, RNG k-ε, k-ω and RSM models in predicting flow ...

متن کامل

Reliability Optimization Models for Fault-Tolerant Distributed Systems

This paper presents four models to demonstrate our techniques for optimizing software and hardware reliability for fault-tolerant distributed systems. The models help us find the optimal system structure while considering basic information on reliability and cost of the available software and hardware components. Each model is suitable for a distinct set of conditions or situations. All four mo...

متن کامل

On Distributed Computing with Beeps

We consider networks of processes which interact with beeps. Various beeping models are used. The basic one, defined by Cornejo and Kuhn [CK10], assumes that a process can choose either to beep or to listen; if it listens it can distinguish between silence or the presence of at least one beep. The aim of this paper is the study of the resolution of paradigms such as collision detection, computa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015